An efficient evolutionary algorithm for channel resource management in cellular mobile systems
نویسندگان
چکیده
Modern cellular mobile communications systems are characterized by a high degree of capacity. Consequently, they have to serve the maximum possible number of calls while the number of channels per cell is limited. The objective of channel allocation is to assign a required number of channels to each cell such that both efficient frequency spectrum utilization is provided and interference effects are minimized. Channel assignment is therefore an important operation of resource management and its efficient implementation increases the fidelity, capacity, and quality of service of cellular systems. Most channel allocation strategies are based on deterministic methods, however, which result in implementation complexity that is prohibitive for the traffic demand envisaged for the next generation of mobile systems. An efficient heuristic technique capable of handling channel allocation problems is introduced here as an alternative. The method is called a combinatorial evolution strategy (CES) and belongs to the general heuristic optimization techniques known as evolutionary algorithms (EA’s). Three alternative allocation schemes operating deterministically, namely the dynamic channel assignment (DCA), the hybrid channel assignment (HCA), and the borrowing channel assignment (BCA), are formulated as combinatorial optimization problems for which CES is applicable. Simulations for representative cellular models show the ability of this heuristic to yield sufficient solutions. These results will encourage the use of this method for the development of a heuristic channel allocation controller capable of coping with the traffic and spectrum management demands for the proper operation of the next generation of cellular systems.
منابع مشابه
An Energy-efficient Mathematical Model for the Resource-constrained Project Scheduling Problem: An Evolutionary Algorithm
In this paper, we propose an energy-efficient mathematical model for the resource-constrained project scheduling problem to optimize makespan and consumption of energy, simultaneously. In the proposed model, resources are speed-scaling machines. The problem is NP-hard in the strong sense. Therefore, a multi-objective fruit fly optimization algorithm (MOFOA) is developed. The MOFOA uses the VIKO...
متن کاملAn Efficient Algorithm to Solve Utilization-based Model for Cellular Manufacturing Systems
The design of cellular manufacturing system (CMS) involves many structural and operational issues. One of the important CMS design steps is the formation of part families and machine cells which is called cell formation. In this paper, we propose an efficient algorithm to solve a new mathematical model for cell formation in cellular manufacturing systems based on cell utilization concept. The p...
متن کاملMulti-layer Clustering Topology Design in Densely Deployed Wireless Sensor Network using Evolutionary Algorithms
Due to the resource constraint and dynamic parameters, reducing energy consumption became the most important issues of wireless sensor networks topology design. All proposed hierarchy methods cluster a WSN in different cluster layers in one step of evolutionary algorithm usage with complicated parameters which may lead to reducing efficiency and performance. In fact, in WSNs topology, increasin...
متن کاملAn archived multi-objective simulated annealing for a dynamic cellular manufacturing system
To design a group layout of a cellular manufacturing system (CMS) in a dynamic environment, a multi-objective mixed-integer non-linear programming model is developed. The model integrates cell formation, group layout and production planning (PP) as three interrelated decisions involved in the design of a CMS. This paper provides an extensive coverage of important manufacturing features u...
متن کاملA multi-objective resource-constrained optimization of time-cost trade-off problems in scheduling project
This paper presents a multi-objective resource-constrained project scheduling problem with positive and negative cash flows. The net present value (NPV) maximization and making span minimization are this study objectives. And since this problem is considered as complex optimization in NP-Hard context, we present a mathematical model for the given problem and solve three evolutionary algorithms;...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Evolutionary Computation
دوره 2 شماره
صفحات -
تاریخ انتشار 1998